Collaborative Network Monitoring by Means of Laplacian Spectrum Estimation and Average Consensus
نویسندگان
چکیده
منابع مشابه
Decentralized Laplacian Eigenvalues Estimation and Collaborative Network Topology Identification
In this paper we first study observability conditions on networks. Based on spectral properties of graphs, we state new sufficient or necessary conditions for observability. These conditions are based on properties of the Khatri-Rao product of matrices. Then we consider the problem of estimating the eigenvalues of the Laplacian matrix associated with the graph modeling the interconnections betw...
متن کاملDistributed Cooperative Spectrum Sensing Using Weighted Average Consensus
In this paper, we study the distributed spectrum sensing in cognitive radio networks. Existing distributed consensus-based fusion algorithms only ensure equal gain combining of local measurements, whose performance may be incomparable to various centralized soft combining schemes. Motivated by this fact, we consider practical channel conditions and link failures, and develop new weighted soft m...
متن کاملDynamic consensus estimation of weighted average on directed graphs
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملNormalized laplacian spectrum of two new types of join graphs
Let $G$ be a graph without an isolated vertex, the normalized Laplacian matrix $tilde{mathcal{L}}(G)$ is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$, where $mathcal{D}$ is a diagonal matrix whose entries are degree of vertices of $G$. The eigenvalues of $tilde{mathcal{L}}(G)$ are called as the normalized Laplacian eigenva...
متن کاملThe exact Laplacian spectrum for the Dyson hierarchical network
We consider the Dyson hierarchical graph , that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter σ ∈ (1/2, 1]. Exploiting the deterministic recursivity through which is built, we are able to derive explicitly the whole set of the eigenvalues and the eigenvectors for its Laplacian matrix. Given that the Laplacian operator is intrinsically implied in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Control, Automation and Systems
سال: 2019
ISSN: 1598-6446,2005-4092
DOI: 10.1007/s12555-018-0638-0